Comparing local search paths with global search paths on protein residue networks: allosteric communication
نویسندگان
چکیده
منابع مشابه
Comparing local search paths with global search paths on protein residue networks: allosteric communication
Although proteins have been recognized as small-world networks and their small-world network properties of clustering and short paths have been exploited computationally to produce biologically relevant information, they have not been truly explored as such, i.e. as navigable small-world networks in the original spirit of Milgram’s work. This research seeks to fill this gap by exploring local s...
متن کاملLocal search on protein residue networks
Self-avoiding random walks were performed on protein residue networks. Compared with protein residue networks with randomized links, the probability of a walk being successful is lower and the length of successful walks shorter in (non-randomized) protein residue networks. Fewer successful walks and shorter successful walks point to higher communication specificity between protein residues, a c...
متن کاملLocal adiabatic quantum search with different paths
We report on a detailed analysis of generalization of the local adiabatic search algorithm. Instead of evolving directly from an initial ground state Hamiltonian to a solution Hamiltonian a different evolution path via a ’sure success’ Hamiltonian is introduced and is shown that the time required to find an item in a database of size N can be made to be almost independent of the size of the dat...
متن کاملLocal Search Heuristics for Disjoint Connecting Paths
Kleinberg’s algorithm, for the maximum disjoint connecting paths problem (max DCP) between k terminal pairs, obtains an approximate solution by routing each terminal pair in turn via the shortest path, deleting each shortest path before routing the next terminal pair, until no such path exists. We suggest that the number of terminal pairs routed is dependent on the order in which the terminal p...
متن کاملProtein residue networks from a local search perspective
We examined protein residue networks (PRNs) from a local search perspective to understand why PRNs are highly clustered when having short paths is important for protein functionality. We found that by adopting a local search perspective, this conflict between form and function is resolved as increased clustering actually helps to reduce path length in PRNs. Further, the paths found via our EDS ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complex Networks
سال: 2016
ISSN: 2051-1310,2051-1329
DOI: 10.1093/comnet/cnw020